Performance Evaluation of MPLS Path Restoration Schemes using OMNET++
نویسندگان
چکیده
Multi-Protocol Label Switching (MPLS) is an alternative to integrate Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees traffic engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. Considering that MPLS is a label switching technology, it uses a method for label distribution based on signaling protocols like LDP (Label Distribution Protocol) among others. In this paper we present the simulation of some LDP messages and assess the performance of three path restoration schemes (Haskin, Makam, and Simple Dynamic) in an MPLS network using OMNET++. The simulation results show that the Simple Dynamic scheme presents a reduced arrival time when sending a message from the source to a destination, when compared to those times obtained to Haskin and Makam schemes.
منابع مشابه
MPLS/IP Analysis and Simulation for the Implementation of Path Restoration Schemes
IP (Internet Protocol) has been traditionally routed over ATM (Asynchronous Transfer Mode) via Virtual Circuits (VCs) or Multi-Protocol over ATM (MPOA). These methods proved to have a complicated operation mode; therefore, the necessity for a simpler method is required. All these necessities can be supported by the Multi-Protocol Label Switching (MPLS) since it integrates the most important cha...
متن کاملReconfigurable Path Restoration Schemes for MPLS Networks
Multi-Protocol Label Switching (MPLS) is an alternative to integrate the traditional Internet Protocol (IP) routing and switching technologies because it provides end-to-end Quality of Service (QoS), guarantees Traffic Engineering, and support Virtual Private Networks (VPNs). However, MPLS must use path restoration schemes to guarantee the delivery of packets through a network. In this paper we...
متن کاملFast Recovery of MPLS Paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove that a shortest path in a network after removing k edges is the concatenation of at most k + 1 shortest paths in the original network. The theory is then combined with efficient path concatenation techniques in MPLS (mul...
متن کاملAdaptive segment path restoration (ASPR) in MPLS networks
Two important factors must be considered when selecting a restoration scheme in MPLS networks. Firstly, the restoration time, and consequentially the packet latency of the restored trafiic, has to satisfy the requirements of realtime services. Secondly, the spare capacity requirement should be costeffective. This paper proposes a novel proactive restoration scheme that is both fast-acting and r...
متن کاملPerformance Analysis about the Failure Restoration Scheme Using a Multi-path in Hierarchical MPLS Networks
Various technologies about multi-path calculation for extensibility and failure restoration have been suggested as an increasing demand for QoS in MPLS networks. However, the MPLS networks have problems in extensibility for network traffic, failure restoration that waste usage of resources and much delay. Thus, we propose to H-MPLS networks recover failure in networks fast and support efficient...
متن کامل